Applying the Hungarian Method to Stereo Matching

نویسندگان

  • Gabriel Fielding
  • Moshe Kam
چکیده

The correspondence problem in stereo vision is to calculate matches between pixels (points) or features (e.g., lines) in stereo images. The method of calculating these matches over an entire stereo image pair usually depends upon the application for which the resulting depth information will be used. Functional minimization and dynamic programming are two widely used techniques for selecting matches. We present an alternative technique based on integer-programming formulation of the correspondence problem. Computation of the disparity map is accomplished in polynomial time by casting the selection of matches along corresponding epipolar lines as the problem of nding a maximum weighted matching on bipartite graphs. This approach incorporates several desirable properties of disparity maps, including implicit occlusion estimation, preference for fronto-parallel surfaces, and improved performance in the absence of texture (when compared to non-global techinques which do not maximize over the entire epipolar line).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

New Pseudo-CT Generation Approach from Magnetic Resonance Imaging using a Local Texture Descriptor

Background: One of the challenges of PET/MRI combined systems is to derive an attenuation map to correct the PET image. For that, the pseudo-CT image could be used to correct the attenuation. Until now, most existing scientific researches construct this pseudo-CT image using the registration techniques. However, these techniques suffer from the local minima of the non-rigid deformation energy f...

متن کامل

Self-Adaptive Matching In Local Windows For Depth Estimation

This paper proposes a novel local stereo matching approach based on self-adapting matching window. We improve the accuracy of stereo matching in 3 steps. First, we integrate shape and size information, and construct robust minimum matching windows by applying a self-adapting method. Then, two matching cost optimization strategies are employed for handling both occlusion regions and image border...

متن کامل

A voting stereo matching method for real-time obstacle detection

− Depth from stereo is one of the most active research areas in the computer vision field. The heavily investigated problem in stereo approaches is the matching between two or more images of a scene observed, by two or more video cameras, from different viewpoints. It consists of identifying features in the left and right images that are projections of the same physical feature in the threedime...

متن کامل

An asymmetric post-processing for correspondence problem

This paper presents a novel approach that performs post-processing for stereo matching. We improve the performance of stereo matching by performing consistency check and adaptive filtering in an iterative filtering scheme. The consistency check is only done with asymmetric information so that very few additional computational loads are necessary. The information in the valid pixels is propagate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997